On scenario aggregation to approximate robust combinatorial optimization problems
نویسندگان
چکیده
منابع مشابه
On Scenario Aggregation to Approximate Robust Combinatorial Optimization Problems
As most robust combinatorial min-max and min-max regret problems with discrete uncertainty sets are NP-hard, research in approximation algorithm and approximability bounds has been a fruitful area of recent work. A simple and well-known approximation algorithm is the midpoint method, where one takes the average over all scenarios, and solves a problem of nominal type. Despite its simplicity, th...
متن کاملOn Scenario Aggregation to Approximate Robust Optimization Problems
As most robust combinatorial min-max and min-max regret problems with discrete uncertainty sets are NP-hard, research into approximation algorithm and approximability bounds has been a fruitful area of recent work. A simple and wellknown approximation algorithm is the midpoint method, where one takes the average over all scenarios, and solves a problem of nominal type. Despite its simplicity, t...
متن کاملApproximate Shifted Combinatorial Optimization
Shifted combinatorial optimization is a new nonlinear optimization framework, which is a broad extension of standard combinatorial optimization, involving the choice of several feasible solutions at a time. It captures well studied and diverse problems ranging from congestive to partitioning problems. In particular, every standard combinatorial optimization problem has its shifted counterpart, ...
متن کاملAn approximate algorithm for combinatorial optimization problems with two parameters
We call a minimum cost restricted time combinatorial optimization (MCRT) problem any problem that has a finite set P, finite family S of subsets of P, non-negative threshold h, and two non-negative real-valued functions y : (say, cost) and x : p......-? R+ (say, time). One seeks a solution F* E S with y(F*) min{y(F): F E S, x(F):S h}, where x(G) L:gEGx(g), y(G) = L:gEGy(g) and G E S. We also as...
متن کاملOn Solving Combinatorial Optimization Problems
We present a new viewpoint on how some combinatorial optimization problems are solved. When applying this viewpoint to the NP -equivalent traveling salesman problem (TSP), we naturally arrive to a conjecture that is closely related to the polynomialtime insolvability of TSP, and hence to the P −NP conjecture. Our attempt to prove the conjecture has not been successful so far. However, the bypro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2017
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-017-1206-x